Point Pattern Matching Algorithm for Planar Point Sets under Euclidean Transform
نویسندگان
چکیده
منابع مشابه
Point Pattern Matching Algorithm for Planar Point Sets under Euclidean Transform
Point pattern matching is an important topic of computer vision and pattern recognition. In this paper, we propose a point pattern matching algorithm for two planar point sets under Euclidean transform.We view a point set as a complete graph, establish the relation between the point set and the complete graph, and solve the point pattern matching problem by finding congruent complete graphs. Ex...
متن کاملPattern Matching for Spatial Point Sets
Two sets of points in -dimensional space are given: a data set consisting of points, and a pattern set or probe consisting of points. We address the problem of determining whether there is a transformation, among a specified group of transformations of the space, carrying into or near (meaning at a small directed Hausdorff distance of) . The groups we consider are translations and rigid motions...
متن کاملAn Efficient Approximation Algorithm for Point Pattern Matching Under Noise
Point pattern matching problems are of fundamental importance in various areas including computer vision and structural bioinformatics. In this paper, we study one of the more general problems, known as LCP (largest common point set problem): Let P and Q be two point sets in R, and let ǫ ≥ 0 be a tolerance parameter, the problem is to find a rigid motion μ that maximizes the cardinality of subs...
متن کاملGenetic algorithm for affine point pattern matching
Point pattern matching (PPM) is an important topic in the fields of computer vision and pattern recognition. According to if there exists a one to one mapping between the two point sets to be matched, PPM can be divided into the case of complete matching and the case of incomplete matching. According to if utilizing information other than 2-D image coordinates, PPM can be divided into labelled ...
متن کاملA Concave Optimization Algorithm for Matching Partially Overlapping Point Sets
Point matching refers to the process of finding spatial transformation and correspondences between two sets of points. In this paper, we focus on the case that there is only partial overlap between two point sets. Following the approach of the robust point matching method, we model point matching as a mixed linear assignment−least square problem and show that after eliminating the transformatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics
سال: 2012
ISSN: 1110-757X,1687-0042
DOI: 10.1155/2012/139014